An Analytic Method for Convergence Acceleration of Certain Hypergeometric Series
نویسندگان
چکیده
منابع مشابه
An Analytic Method for Convergence Acceleration of Certain Hypergeometric Series
A method is presented for convergence acceleration of the generalized hypergeometric series 3F2 with the argument ±1 , using analytic properties of their terms. Iterated transformation of the series is performed analytically, which results in obtaining new fast converging expansions for some special functions and mathematical constants.
متن کاملHypergeometric series acceleration via the WZ method
Based on the WZ method, some series acceleration formulas are given. These formulas allow us to write down an infinite family of parametrized identities from any given identity of WZ type. Further, this family, in the case of the Zeta function, gives rise to many accelerated expressions for ζ(3). AMS Subject Classification: Primary 05A We recall [Z] that a discrete function A(n,k) is called Hyp...
متن کاملUniform convergence of hypergeometric series
The considered problem is uniform convergence of sequences of hypergeometric series. We give necessary and sufficient conditions for uniformly dominated convergence of infinite sums of proper bivariate hypergeometric terms. These conditions can be checked algorithmically. Hence the results can be applied in Zeilberger type algorithms for nonterminating hypergeometric series.
متن کاملConvergence Acceleration of Alternating Series
We discuss some linear acceleration methods for alternating series which are in theory and in practice much better than that of Euler-Van Wijngaarden. One of the algorithms, for instance, permits one to calculate P (?1) k a k with an error of about 17:93 ?n from the rst n terms for a wide class of sequences fa k g. Such methods are useful for high precision calculations frequently appearing in ...
متن کاملConvergence acceleration of alternating series
A new simple convergence acceleration method is proposed for a certain wide range class of convergent alternating series. The method has some common features with Smith’s and Ford’s modification of Levin’s and Weniger’s sequence transformations, but it leads to less computational and memory cost. The similarities and differences between all three methods are analyzed and some common theoretical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1995
ISSN: 0025-5718
DOI: 10.2307/2153446